An Evaluation of K-Center Problem Solving Techniques, towards Optimality
نویسندگان
چکیده
Optimization of facility location problem is one of the prominent areas of research since last few decades. The vertex k-center problem represents a common occurring problem with in public and private sectors. Consistent efforts are going towards optimal solution of this NP-hard nature problem. The aim of this paper is to highlight the different aspects of algorithmic approach made in this area, so far. Relevant suggestions and modifications are also incorporated in this paper.
منابع مشابه
On the hybrid conjugate gradient method for solving fuzzy optimization problem
In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...
متن کاملEffectiveness of an Integrative Protocol in Reducing the Negative Attitude towards Problem Solving as a Determinant of Suicidality among Teenagers and Youth 15-24 Years old in Ilam, Iran
Background and Aim: Adolescents' attitude to suicide is one of the major problems in mental health. Thus, research in this area is of utmost importance. The objective of this study was to determine the effectiveness of an integrated protocol in reducing the negative attitude toward problem solving as a determinant of suicidal tendency in adolescents and young people 15-24 years old in Ilam, Ir...
متن کاملDynamic Assessment( DA) and Evaluation of Problem-solving Skills in Childeren
Introduction: The term dynamic assessment (DA) refers to an assessment, by an active teaching process, of a child's perception, learning, thinking, and problem solving. The process is aimed at modifying an individual's cognitive functioning and observing subsequent changes in learning and problem-solving patterns within the testing situation. DA has been advocated as an alternative and/or sup...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کامل